منابع مشابه
Computation of capacity
This article introduces a method for computing upper and lower bounds for the logarithmic capacity of a compact plane set. If the set has the Hölder continuity property, then these bounds converge to the value of the capacity. A number of examples are discussed in detail, including the Cantor middle-third set, for which we estimate c(E) ≈ 0.220949102189507.
متن کاملCommunication capacity of quantum computation.
By considering quantum computation as a communication process, we relate its efficiency to its classical communication capacity. This formalism allows us to derive lower bounds on the complexity of search algorithms in the most general context. It enables us to link the mixedness of a quantum computer to its efficiency and also allows us to derive the critical level of mixedness beyond which th...
متن کاملThe Capacity of Private Computation
We introduce the problem of private computation, comprised of N distributed and non-colluding servers, K datasets, and a user who wants to compute a function of the datasets privately, i.e., without revealing which function he wants to compute to any individual server. This private computation problem is a strict generalization of the private information retrieval (PIR) problem, by expanding th...
متن کاملCapacity-Constrained Voronoi Tessellations: Computation and Applications
Voronoi tessellations specify a partition of a given space according to a set of sites where all points in that space are assigned to the closest site. Capacity-constrained Voronoi tessellations are special cases of Voronoi tessellations in which the region of each site has a predefined area. For example, the capacity constraint could state that each region in a Voronoi tessellation must have t...
متن کاملNetwork Capacity for Latent Attractor Computation
Attractor networks have been one of the most successful paradigms in neural computation and have been used as models of computation in the nervous system Many experimentally observed phenomena such as coherent population codes contextual representations and replay of learned neural activity patterns are explained well by attractor dynamics Recently we proposed a paradigm called latent attractor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2007
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-07-01941-2